Maximal ordered fields of rank $n$. II

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal dimensional partially ordered sets II. characterization of 2n-element posets with dimension n

In this paper, we show that if a partially ordered set has 2n elements and has dimension n, then it is isosnorphic to the set of n-l element subsets and lelement subsets of a sef, ordered by inclusion, or else it has six elements and is isomorphic to a partially ordered b;i we call the chevron or to its dual.

متن کامل

Tropical Independence Ii: the Maximal Rank Conjecture for Quadrics

Building on our earlier results on tropical independence and shapes of divisors in tropical linear series, we give a tropical proof of the maximal rank conjecture for quadrics. We also prove a tropical analogue of Max Noether’s theorem on quadrics containing a canonically embedded curve, and state a combinatorial conjecture about tropical independence on chains of loops that implies the maximal...

متن کامل

Rank Ordered Autoencoders

A new method for the unsupervised learning of sparse representations using autoencoders is proposed and implemented by ordering the output of the hidden units by their activation value and progressively reconstructing the input in this order. This can be done efficiently in parallel with the use of cumulative sums and sorting only slightly increasing the computational costs. Minimizing the diff...

متن کامل

The Maximal Rank Conjecture

Let C be a general curve of genus g, embedded in Pr via a general linear series of degree d. In this paper, we prove the Maximal Rank Conjecture, which determines the Hilbert function of C ⊂ Pr.

متن کامل

Dynamic Rank-Maximal Matchings

We consider the problem of matching applicants to posts where applicants have preferences over posts. Thus the input to our problem is a bipartite graph G = (A ∪ P , E), where A denotes a set of applicants, P is a set of posts, and there are ranks on edges which denote the preferences of applicants over posts. A matching M in G is called rank-maximal if it matches the maximum number of applican...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Hiroshima Mathematical Journal

سال: 1988

ISSN: 0018-2079

DOI: 10.32917/hmj/1206129869